Strategic, Tactical and Real-time Planning of Locomotives at Norfolk Southern Using Approximate Dynamic Programming
نویسندگان
چکیده
Locomotive planning has been a popular application of classical optimization models for decades, but with very few success stories. There are a host of complex rules governing how locomotives should be used. In addition, it is necessary to simultaneously manage locomotive inventories by balancing the need for holding power against the need for power at other yards. At the same time, we have to plan the need to return foreign power, and move power to maintenance facilities for scheduled FRA appointments. An additional complication arises as a result of the high level of uncertainty in transit times and delays due to yard processing, and as a result we may have to plan additional inventories in order to move outbound trains on time despite inbound delays. We describe a novel modeling and algorithmic strategy known as approximate dynamic programming, which can also be described as a form of “optimizing simulator” which uses feedback learning to plan locomotive movements in a way that closely mimics how humans plan real-world operations. This strategy can be used for strategic and tactical planning, and can also be adapted to real-time operations. We describe the strategy, and summarize experiences at Norfolk Southern with a strategic planning system. INTRODUCTION Locomotive planning is one of the most complex operational problems in freight transportation. Planners have to take into consideration a host of operational characteristics that describe a locomotive to best utilize the fleet to meet the service requirements of the trains. Locomotive fleets can represent billions of dollars in investments, and as a result railroads have every incentive to manage this investment as efficiently as possible. The complexity of the problem has put it well past the capabilities of even today’s advanced optimization solvers. Completely overlooked in these models are the important sources of uncertainty such as transit time delays, the dynamics of scheduling commodities such as coal and grain, and the ever present problem of equipment failures and maintenance. Railroads face three classes of planning problems when managing railroads: Strategic planning – The major question here is fleet size and mix, but other questions can include understanding the impact of improvements in transit time reliability, the effect of changes in train plans and changes in interchange policies with other railroads. Tactical planning and operational forecasting – Here the horizon is 1-7 days, and the question is whether there will be significant shortages of power that might require additional repositioning, short-term modifications in leasing decisions and perhaps the decision to retain locomotives that belong to other railroads (known as “foreign power”) and incur additional per diem charges. Real-time planning – The decision here is the assignment of specific locomotives to specific trains that are departing over the immediate horizon (typically the next 12 hours).
منابع مشابه
Approximate dynamic programming for rail operations
Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled using classical math programming models defined over space-time networks. Even simplified models can be hard to solve, requiring the use of various heuristics. We show how to combine math programming and simulation in an ADP-f...
متن کاملLocomotive Planning at Norfolk Southern: An Optimizing Simulator Using Approximate Dynamic Programming
Full terms and conditions of use:
متن کاملA multi-period fuzzy mathematical programming model for crude oil supply chain network design considering budget and equipment limitations
The major oil industry upstream activities include the exploration, drilling, extraction, pipelines installation, and production of crude oil. In this paper, we develop a mathematical model to plan for theseoperations as a crude oil supply chain network design problem.The proposed multi-period mixed integer linear programming model entails both strategic (e.g., facility location and allocation)...
متن کاملTactical Planning in Healthcare using Approximate Dynamic Programming
Tactical planning of resources in hospitals concerns elective patient admission planning and the intermediate term allocation of resource capacities. Its main objectives are to achieve equitable access for patients, to serve the strategically agreed number of patients, and to use resources efficiently. We propose a method to develop a tactical resource allocation and patient admission plan that...
متن کاملA queuing-location model for in multi-product supply chain with lead time under uncertainty
Supply chain network design (SCND) problem has recently been gaining attention because an integrated management of the supply chain (SC) can reduce the unexpected/undesirable events and can affect definitely the efficiency of all the chain. A critical component of the planning activities of a manufacturing firm is the efficient design of its SC. Hence, SCND affords a sensitive platform for effi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012